Von Neumann-Morgenstern Stable Sets and the Non-cooperative Solution to the Bargaining Problem

نویسندگان

  • Klaus Kultti
  • Hannu Vartiainen
چکیده

We establish a general n-player link between non-cooperative bargaining and the Nash solution. Non-cooperative bargaining is captured in a reduced form through the von Neumann-Morgenstern (1944) stability concept. A stable set always exists. Moreover, if the utility set has a smooth surface, then any stable set converges to the Nash bargaining solution. Finally, the equivalence of stationary equilibria of the unanimity bargaining game and the stable set solution is demonstrated. JEL Classification: C71, C78

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Von Neumann-Morgenstern Stable Set Bridges Time-Preferences to the Nash Solution

We apply the von Neumann-Morgenstern stable set to the n-player cake division problem. Only time-preferences á la Rubinstein (1982) are assumed. The stable set is defined with respect to the following dominance relation: x dominates y if there is a player who prefers x over y even with one period lag. The Nash bargaining solution is characterized in the language of stable sets. Through the char...

متن کامل

Von Neumann-Morgenstern stable sets, discounting, and Nash bargaining

We establish a link between von Neumann–Morgenstern stable set and the Nash solution in a general n-player utility set. The stable set-solution is defined with respect to a dominance relation: payoff vector u dominates v if one player prefers u even with one period delay. We show that a stable set exists and, if the utility set has a smooth surface, any stable set converges to the Nash bargaini...

متن کامل

Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von Neumann-Morgenstern farsightedly stable set if and only if it is a singleton set and its element is a cor...

متن کامل

The Context of for Nash's Work: Von Neumann and Morgenstern

Nash originated general non-cooperative game theory in seminal articles in the early 1950s by formally distinguishing between non-cooperative and cooperative models and by developing the concept of equilibrium for noncooperative games. Nash developed the first bargaining solution characterized by axioms, pioneered methods and criteria for relating cooperativetheory solution concepts and non-coo...

متن کامل

Noncooperative foundations of stable sets in voting games

This note investigates the noncooperative foundations of von Neumann-Morgenstern (vN-M) stable sets in voting games. To do so, we study subgame perfect equilibria of a noncooperative legislative bargaining game, based on underlying simple games. The following results emerge from such an exercise: Every stable set of the underlying simple game is the limit set of undominated pure-strategy Markov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006